A morphic representation of EOL languages and other ETOL languages

A note on exponential density of ETOL languages

A Tranlsational Theorem for the Class of EOL Languages

If K is not a context-free language, then sh(K, a*) is not an EOL language (where sh(Ki,Kz) denotes the shuffle of the languages K i and K2, and a is a symbol not in the alphabet of K). Hence the class of context-free languages is the largest full AFL inside the class of EOL languages.

Recognition of Deterministic ETOL Languages in Logarathimic Space

Recently considerable interest has been shown in questions concerning the complexity of the membership problem for various types of L systems3 In van Leeuwen (1975a) it is shown that there is an E T O L system G such that the set L(G) is ~/ '~-complete . Opatrn3~ and Culik (1975) showed that EOL membership could be determined by a D T I M E (n 4) algorithm, and Sudborough (1976) gave a DSPACE((...

Metacognitive (Rending) Strategies Across Languages and Techniques

Succinct Representation and Leaf Languages

In this paper, we present stronger results in the theory of succinct problem representation and establish a close relationship between succinct problems and leaf languages. As a major tool, we use projection reductions from descriptive complexity theory. A succinct problem is a problem whose high complexity stems from the fact that its instances are not given straightforward, but are themselves...